منابع مشابه
Universality Results for Models in Locally Boolean Domains
In [6] J. Laird has shown that an infinitary sequential extension of PCF has a fully abstract model in his category of locally boolean domains (introduced in [8]). In this paper we introduce an extension SPCF∞ of his language by recursive types and show that it is universal for its model in locally boolean domains. Finally we consider an infinitary target language CPS∞ for (the) CPS translation...
متن کاملLocally Boolean Domains and Universal Models for Infinitary Sequential Languages
In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps (as introduced in [Lai05b]) and show that the category of locally boolean domains and bistable maps is equivalent to the category of Curien-Lamarche games and observably sequential functions (cf. [CCF94]). Further we show that the category of locally boolean domains has inverse limits of ω-chains...
متن کاملLocally GCD domains and the ring $D+XD_S[X]$
An integral domain $D$ is called a emph{locally GCD domain} if $D_{M}$ is aGCD domain for every maximal ideal $M$ of $D$. We study somering-theoretic properties of locally GCD domains. E.g., we show that $%D$ is a locally GCD domain if and only if $aDcap bD$ is locally principalfor all $0neq a,bin D$, and flat overrings of a locally GCD domain arelocally GCD. We also show that the t-class group...
متن کاملLocally monotone Boolean and pseudo-Boolean functions
We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...
متن کاملLocally Invertible Boolean Mappings
The aim of this paper is to study a novel property of Boolean mappings called local intert-ibility. We focus on local invertibility of Boolean mappings which model ltering generators and study the case when ltering function is linear in the last variable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.06.007